Geometric Hitting Sets and Their Variants
نویسنده
چکیده
Geometric Hitting Sets and Their Variants
منابع مشابه
Geometric Hitting Sets for Disks: Theory and Practice
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, ...
متن کاملEnumerating Minimal Transversals of Geometric Hypergraphs
We consider the problem of enumerating all minimal hitting sets of a given hypergraph (V,R), where V is a finite set, called the vertex set andR is a set of subsets of V called the hyperedges. We show that, when the hypergraph admits a balanced subdivision, then a recursive decomposition can be used to obtain efficiently all minimal hitting sets of the hypergraph. We apply this decomposition fr...
متن کاملBody shape comparison of Big-head carp with two variants of silver carp using geometric morphometric techniques
In order to investigate the differences in the shape of the big-head and two morphotypes of Phytophagous fish by geometric morphometric technique, 30 samples of each group, with a mean standard length of 25 ± 3 cm, were prepared. After fish were anesthetized by 1% Clove powder extract and stabilized in formalin buffer 4%, 6-megapixel digital images of the left profile of the specimens were prep...
متن کاملOptimal Hitting Sets for Combinatorial Shapes
We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combinatorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpi...
متن کاملTighter Estimates for epsilon-nets for Disks
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a smallsized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, s...
متن کامل